Fast Recursive Computation of Sliding DHT with Arbitrary Step
نویسندگان
چکیده
منابع مشابه
Fast computation of the sliding - window
We have developed a fast and robust algorithm for the extraction of 3-D seismic attributes. The algorithm is based on the recursive computation of the 3-D sliding-window Radon transform. Considerable gain in computational eeciency has been achieved with respect to existing algorithms. Field data results demonstrate the eeectiveness of the method for 3-D seismic interpretation.
متن کاملFast computation of morphological operations with arbitrary structuring elements
This paper presents a general algorithm that performs basic mathematical morphology operations, like erosions and openings, with any arbitrary shaped structuring element in an efficient way. It is shown that our algorithm has a lower or equal complexity but better computing time than all comparable known methods.
متن کاملDHT Based Searching Improved by Sliding Window
Efficient full-text searching is a big challenge in Peer-to-Peer (P2P) system. Recently, Distributed Hash Table (DHT) becomes one of the reliable communication schemes for P2P. Some research efforts perform keyword searching and result intersection on DHT substrate. Two or more search requests must be issued for multi-keyword query. This article proposes a Sliding Window improved Multi-keyword ...
متن کاملA New Recursive Decomposition Algorithm for Realizing Fast IMDCT Computation
In this paper, a new decomposition algorithm for realizing fast inverse modified discrete cosine transform (IMDCT) computation is presented. The decomposition algorithm can convert a pair of long transforms into 2 pairs of short transforms with half size of the long transforms. In addition, the decomposition algorithm can be utilized recursively to attain shorter transforms and reduce computati...
متن کاملA Uni ed Systolic Array for Fast Computation of the DCT/DST/DHT
This paper proposes a two-dimensional (2-D) VLSI architecture using a uni ed systolic array for fast computation of the discrete cosine transform/discrete sine transform/discrete Hartley transform (DCT/DST/DHT). The N -point discrete transform is decomposed into evenand oddnumbered frequency samples and they are computed independently at the same time. The proposed uni ed systolic array archite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2020
ISSN: 1424-8220
DOI: 10.3390/s20195556